#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;

const int N=10010;

int p[N];
int n,ans=0;

void print(int cnt)
{
	printf("%d=",n);
	for(int i=0;i<cnt;i++)
	{
		printf("%d",p[i]);
		if(i!=cnt-1) printf("+");
	}
	ans++;
	if(ans%4==0) puts("");
	else printf(";");
}

void solve(int last,int cnt,int t)
{
	if(last < 0) return;
	else if(last == 0) print(cnt);
	
	for(int i=t;i<=n;i++)
	{
		if(last-i < 0) return ;
		p[cnt++]=i;
		solve(last-i,cnt,i);
		cnt--;
	}
}

int main()
{
	scanf("%d",&n);
	solve(n,0,1);
	return 0;
}
